A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

网络化无人水下航行器CAN总线调度方法

传感器时间驱动,控制器和执行器均为事件驱动的网络控制系统节点驱动方式,已在众多的网络控制系统研究中被采用。在此种节点驱动方式下,依据各控制回路传感信息的不同时间性质将网络化无人水下航行器各控制回路划分为周期性控制回路和随机性控制回路来进行处理。采用时分复用原理对系统总线传输时间进行划分,通过递归遍历寻优方法对系统周期性控制回路信息传输需求进行优化调度;基本周期最小时间余量最大的寻优指标确保了总线负载均衡和随机性控制回路信息传输需求得到及时满足,这样有效地减少了低优先级控制回路(节点)信息传输的延迟等待时间。利用M ATLAB/T uretim e工具进行仿真试验,仿真结果说明了调度方法的有效性。     

基于马尔可夫过程的武器系统相关失效分析

利用马尔可夫过程分别对共因失效和载荷共享失效两种相关失效的系统平均失效时间进行了建模分析。针对同时出现两种相关失效的武器系统进行了实例分析,并将结果和不考虑相关失效时的计算结果进行了对比,对相关失效分析在可靠性分析和评价中的重要作用进行了阐述。     

支持向量机的滚动轴承状态监测

提出了一种基于支持向量机的滚动轴承状态监测方法.该方法采用小波能量表征轴承信号的特征,采用支持向量机作为分类器构建支持向量机状态监测系统.仿真实验表明该方法具有很好的在线监测性能和分类性能,该方法对于滚动轴承的监测具有一定的应用价值,并可方便地推广到其他类似的工业应用领域.     

爆扩桩抗拔承载力计算公式研究

目前关于扩底桩尤其是爆扩桩抗拔力计算公式很少。在有限的扩底桩计算公式中,普遍存在着对爆扩桩的承载机理不清楚,对扩大头作用的体现机理表达不准确等问题。首先介绍一些典型的抗拔计算公式,选出有代表性的且适用于爆扩桩的抗拔计算公式, 然后根据工程试桩的计算结果,结合理论分析对公式的合理性进行探讨,最后根据爆扩桩的抗拔机理和试验分析给出易于运用的软土中大直径爆扩桩的抗拔承载力计算公式,并给出相应的构造要求。     

一种航天侦察任务-资源匹配的负载均衡方法

当前航天侦察任务预处理方法一般仅从任务需求的角度考虑资源分配问题,容易导致负载不均衡,对此提出了一种综合考虑任务需求与资源负载的任务-资源匹配方法.分析了资源负载均衡需要考虑的任务要素以及相应的描述方法,提出用任务执行概率度量卫星资源负载状况,基于任务流模型给出了单任务执行概率的估算公式,并给出了一种简易的多任务执行概...     

A computationally efficient approach for determining inventory levels in a capacitated multiechelon production‐distribution system

The system under study is a single item, two‐echelon production‐inventory system consisting of a capacitated production facility, a central warehouse, and M regional distribution centers that satisfy stochastic demand. Our objective is to determine a system base‐stock level which minimizes the long run average system cost per period. Central to the approach are (1) an inventory allocation model and associated convex cost function designed to allocate a given amount of system inventory across locations, and (2) a characterization of the amount of available system inventory using the inventory shortfall random variable. An exact model must consider the possibility that inventories may be imbalanced in a given period. By assuming inventory imbalances cannot occur, we develop an approximation model from which we obtain a lower bound on the per period expected cost. Through an extensive simulation study, we analyze the quality of our approximation, which on average performed within 0.50% of the lower bound. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 377–398, 2000     

Arrival and departure state distributions in the general bulk‐service queue

In this paper, we give an explicit relation between steady‐state probability distributions of the buffer occupancy at customer entrance and departure epochs, for the classical single‐server system G/G^[N]/1 with batch services and for the finite capacity case. The method relies on level‐crossing arguments. For the particular case of Poisson input, we also express the loss probability in terms of state probabilities at departure epochs, yielding probabilities observed by arriving customers. This work provides the “bulk queue” version of a result established by Burke, who stated the equality between probabilities at arrival and departure epochs for systems with “unit jumps.” © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 107–118, 1999     

Optimal capacity in a coordinated supply chain

We consider a supply chain in which a retailer faces a stochastic demand, incurs backorder and inventory holding costs and uses a periodic review system to place orders from a manufacturer. The manufacturer must fill the entire order. The manufacturer incurs costs of overtime and undertime if the order deviates from the planned production capacity. We determine the optimal capacity for the manufacturer in case there is no coordination with the retailer as well as in case there is full coordination with the retailer. When there is no coordination the optimal capacity for the manufacturer is found by solving a newsvendor problem. When there is coordination, we present a dynamic programming formulation and establish that the optimal ordering policy for the retailer is characterized by two parameters. The optimal coordinated capacity for the manufacturer can then be obtained by solving a nonlinear programming problem. We present an efficient exact algorithm and a heuristic algorithm for computing the manufacturer's capacity. We discuss the impact of coordination on the supply chain cost as well as on the manufacturer's capacity. We also identify the situations in which coordination is most beneficial. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

按Weibull分布计算滚动轴承的寿命和强度的可靠性

运用weibull分布推导出任意可靠性指标下滚动轴承的寿命和强度计算公式,给出了多列轴承和轴承系统的可靠性计算方法和公式,并按照工程的方法加以简化处理。